Accurate and efficient spin integration for particle accelerators

Accurate spin tracking is a valuable tool for understanding spin dynamics in particle accelerators and can help improve the performance of an accelerator. In this paper, we present a detailed discussion of the integrators in the spin tracking code gpuSpinTrack. We have implemented orbital integrators based on drift-kick, bend-kick, and matrix-kick splits. On top of the orbital integrators, we have implemented various integrators for the spin motion. These integrators use quaternions and Romberg quadratures to accelerate both the computation and the convergence of spin rotations. We evaluate their performance and accuracy in quantitative detail for individual elements as well as for the entire RHIC lattice. We exploit the inherently data-parallel nature of spin tracking to accelerate our algorithms on graphics processing units.Comment: 43 pages, 17 figure

HRSON: Home-based Routing for Smartphones in Opportunistic Networks

Opportunistic networks are delay-tolerant networks which enable network connectivity while there is limited access to network infrastructure, such as natural disaster happenings. Since opportunistic networks use store-carry-forward mechanism to deliver data, routing algorithms have significant impact on successful data delivery. Due to the Operating System restrictions, creating an opportunistic network using ad-hoc model is not feasible on smartphones and to the best of our knowledge, none of common zero-knowledge routing algorithms have been proposed for a non-ad hoc communication model. In this paper, we propose HRSON, a zero-knowledge routing algorithm in a self-organizing approach that an opportunistic infrastructure-based WiFi network is built to use smartphones. We have deployed our approach in simulated scenario of working days of people, whom are using smartphones, on Helsinki map comparing to common zero-knowledge routing algorithms. The results show that our solution increases the average delivery-rate and lowers delay and commutation overhead

Multi-projects scheduling with resource constraints & Priority rules by the use of Simulated Annealing Algorithm

Ovaj rad predstavlja hibridni genetski algoritam za problem programiranja kod montaže na tekućoj traci s vremenima podešavanja i prijenosa ovisnima o dijelu radne operacije, s ciljevima postizanja smanjenja ponderiranog, zbroja ukupnog ponderiranog kašnjenja na kvadrat, vremenskog intervala, ukupne ponderirane prijevremenosti na kvadrat i broja zakašnjenja. Budući da je problem NP-težak, riješili smo ga hibridnim genetskim algoritmom. Za provjeru predloženog modela korišten je softver Lingo 8.0. Usporedba između rezultata ovog softvera i hibridnog genetskog algoritma pokazuje da kod većih problema (ako je n > 10, gdje je n broj poslova) rezultati dobiveni softverom Lingo 8.0 nisu dovoljno učinkoviti i ne mogu se uspoređivati s predloženim hibridnim genetskim algoritmom u odnosu na vrijeme računanja i devijaciju od minimalne ciljne funkcije. Dani se rezultati ispitivanja za veliki broj rješavanih problema.This paper presents a hybrid genetic algorithm for assembly flow-shop scheduling problem with sequence-dependent setup and transportation times, with objectives, namely the minimizing of weighted, sum of total weighted squared tardiness, makespan, and total weighted squared earliness and number of tardy jobs. Since the problem is NP-hard, we solved this problem by hybrid genetic algorithm. To validate the proposed model, the Lingo 8.0 software is used. Comparison between the results of the Lingo 8.0 and hybrid genetic algorithm shows that in larger problems (if n > 10, where n is the number of jobs) the results obtained by Lingo do not have good efficiency and cannot be compared with the proposed hybrid genetic algorithm in terms of computational time and deviation from the minimum objective function. Test results are provided for a wide range of problem instances

Protein electrophoretic profiles and physiochemical indicators of salinity tolerance in sorghum (Sorghum bicolor L.)

The present study was conducted to quantify the response of chlorophyll, protein concentration and electrophoretic patterns of leaf and root soluble proteins to increasing salinity in the rooting medium of three varieties (Payam, Kimia and Jambo) of sorghum (Sorghum bicolor L.) and to evaluate the usefulness of these parameters in identifying salt-resistant varieties. This work was carried out with five concentrations of salinity (0, 50, 100, 150 and 200 mM NaCl) and two sampling time points (sampling after 15 and 30 days salt treatment) using a split split plot design with randomized complete block layout. With increasing salinity, the K+ concentration was found to decrease and the amount of Na+ and Na+/K+ increase significantly (P≤0.05) in roots and shoots. Chlorophyll a, b, total chlorophyll concentration and leaf and root soluble protein contents decreased with increasing salinity. The electrophoretic pattern of soluble proteins of cv. Jambo showed that after 15 days NaCl (200 mM) and 30 days NaCl (100 and 150 mM) treatment, a new polypeptide of molecular weight 50 kDa was expressed. The expression of this polypeptide might have been due to the plant adapting to NaCl via expression of a stress-resistant gene. This polypeptide was synthesized under salt stress and is suggested as a marker protein for salt adaptation.Keywords: Chlorophyll, electrophoretic patterns, soluble proteins, salinity, sorghu